The Computational Content of Arithmetical Proofs
نویسنده
چکیده
For any extension T of IΣ1 having a cut-elimination property extending that of IΣ1, the number of different proofs that can be obtained by cut-elimination from a single T -proof cannot be bound by a function which is provably total in T .
منابع مشابه
Weak arithmetical interpretations for the Logic of Proofs
Artemov established an arithmetical interpretation for the Logics of Proofs LPCS, which yields a classical provability semantics for the modal logic S4. The Logics of Proofs are parameterized by so-called constant specifications CS, stating which axioms can be used in the reasoning process, and the arithmetical interpretation relies on constant specifications being finite. In this paper, we rem...
متن کاملOn the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness
In this paper the numerical strength of fragments of arithmetical comprehension, choice and general uniform boundedness is studied systematically. These principles are investigated relative to base systems T ω n in all finite types which are suited to formalize substantial parts of analysis but nevertheless have provably recursive function(al)s of low growth. We reduce the use of instances of t...
متن کاملArithmetical proofs of strong normalization results for the symmetric λμ-calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملFrom de Jongh’s theorem to intuitionistic logic of proofs
The famous de Jongh’s theorem of 1970 stated that the intuitionistic logic captured all the logical formulas which have all arithmetical instances derivable in the Heyting Arithmetic HA. In this note we extend de Jongh’s arithmetical completeness property from IPC to the basic intuitionistic logic of proofs, which allows proof assertion statements of the sort x is a proof of F. The logic of pro...
متن کامل7 M ay 2 00 9 Arithmetical proofs of strong normalization results for the symmetric λ μ - calculus
The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong normalization results for this calculus. We show (this is a new result) that the μμ′-reduction is strongly normalizing for the un-typed calculus. We also show the strong normalization of the βμμ′-reduction for the ty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 53 شماره
صفحات -
تاریخ انتشار 2012